翻訳と辞書
Words near each other
・ Lehmann Aviation LA200
・ Lehmann Aviation LA300
・ Lehmann Aviation LM450
・ Lehmann Aviation LP960
・ Lehmann Aviation LV580
・ Lehmann Bernheimer
・ Lehmann discontinuity
・ Lehmann's Honeymoon
・ Lehmann's poison frog
・ Lehmann-Garten
・ Lehmannia
・ Lehmannia macroflagellata
・ Lehmannia marginata
・ Lehmannia melitensis
・ Lehmannia nyctelia
Lehmann–Scheffé theorem
・ Lehmanotus
・ Lehmber Hussainpuri
・ Lehmbruck
・ Lehmbruck Museum
・ Lehmen
・ Lehmer
・ Lehmer code
・ Lehmer matrix
・ Lehmer mean
・ Lehmer number
・ Lehmer random number generator
・ Lehmer sieve
・ Lehmer's conjecture
・ Lehmer's GCD algorithm


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Lehmann–Scheffé theorem : ウィキペディア英語版
Lehmann–Scheffé theorem

In statistics, the Lehmann–Scheffé theorem is prominent statement, tying together the ideas of completeness, sufficiency, uniqueness, and best unbiased estimation.〔 The theorem states that any estimator which is unbiased for a given unknown quantity and that depends on the data only through a complete, sufficient statistic is the unique best unbiased estimator of that quantity. The Lehmann–Scheffé theorem is named after Erich Leo Lehmann and Henry Scheffé, given their two early papers.〔〔
If ''T'' is a complete sufficient statistic for ''θ'' and E(''g''(''T'')) = ''τ''(''θ'') then ''g''(''T'') is the uniformly minimum-variance unbiased estimator (UMVUE) of ''τ''(''θ'').
==Statement==

Let \vec= X_1, X_2, \dots, X_n be a random sample from a distribution that has p.d.f (or p.m.f in the discrete case) f(x:\theta) where \theta \in \Omega is a parameter in the parameter space. Suppose Y = u(\vec) is a sufficient statistic for ''θ'', and let \ be a complete family. If \phi:\mathbb() = \theta then \phi(Y) is the unique MVUE of ''θ''.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Lehmann–Scheffé theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.